Who is Pointing When to Whom? On the Automated Verification of Linked List Structures
نویسندگان
چکیده
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each other via pointers. Our logic is focused on specifying properties about the dynamic evolution (such as creation, adaptation, and removal) of such pointer structures. The semantics is based on automata on infinite words, extended with appropriate means to model evolving pointer structures in an abstract manner. A tableau-based model-checking algorithm is proposed to automatically verify these automata against formulae in our logic.
منابع مشابه
Verification of Programs with Complex Data
In this thesis, we discuss methods of model checking of infinite-state space systems based on symbolic verification—in particular, we concentrate on the use of the so-called regular tree model checking. As a part of our original contribution, we first present abstract regular tree model checking (ARTMC), a technique based on a combination of regular tree model checking with an automated abstrac...
متن کاملAbstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen and J.W. Sanders 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. Abstract. A set-theoretic formalism, AOG, is introduced to support automated verification of pointer programs. AOG targets pointer reaA set-theoretic formalism, AOG, is introduced to support automated verification of pointer programs. AOG targe...
متن کاملFace Detection with methods based on color by using Artificial Neural Network
The face Detection methodsis used in order to provide security. The mentioned methods problems are that it cannot be categorized because of the great differences and varieties in the face of individuals. In this paper, face Detection methods has been presented for overcoming upon these problems based on skin color datum. The researcher gathered a face database of 30 individuals consisting of ov...
متن کاملAutomated Verification of Concurrent Linked Lists with Counters
We present an automated veriication technique for veriica-tion of concurrent linked lists with integer variables. We show that using our technique one can automatically verify invariants that relate (unbounded) integer variables and heap variables such as head 6 = null ! numItems > 0. The presented technique extends our previous work on composite symbolic representations with shape analysis. Th...
متن کاملRefinement-Based Verification for Possibly-Cyclic Lists
In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an acyclic linked list [10]. This paper reports on the automatic verification of the total correctness (partial correctness and termination) of the same list-reversal algorithm, when applied to a possibly-cyclic linked ...
متن کامل